Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
*(x, +(y, z)) → +(*(x, y), *(x, z))
*(+(x, y), z) → +(*(x, z), *(y, z))
*(x, 1) → x
*(1, y) → y
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
*(x, +(y, z)) → +(*(x, y), *(x, z))
*(+(x, y), z) → +(*(x, z), *(y, z))
*(x, 1) → x
*(1, y) → y
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Precedence:
*2 > +2
1 > +2
Status:
+2: multiset
1: multiset
*2: multiset